Timed Results of Testing 5 programs that starting from a given Directory: finds, counts and lists Bas files found.

bplus has 3:
1. Original Recursive finder that uses a GetLists routine that oddly requires a ChDir to search Directory before getting sub-dirs and files. After fixing GetLists error and then applying a slash fix for the OS, it turns out the faster time:
5.4359, 5.5239

2. Non Recursive finder based on same GetLists routine that requires the ChDir like above. It just uses a stack array to make calls to sub directories instead of using recursion. Might be a shade slower because does not use built in stack.
5.4969. 5.5628

3. Recursion 2 uses Steve's revised GetLists routine that performs File and Folder checks on every item! This routine does not need to ChDir before gathering data on the folder. I believe time are more than twice the first 2 tests because of the file and folder checking. But!, if you want to inquire on a folder that Windows won't let you ChDir to you will still succeed unlike the first 2 programs above. 
13.2789, 13.1589

SMcNeill (Steve):
4. Uses a recursive GetAll routine that calls on GetDir routine. I just noticed it uses only "\" slash twice in GetAll making it a Windows only routine.
15.8621, 15.6801

note: all 4 of the programs above require a direntry.h file in the same folder as QB64.exe

SpriggsySpriggs:
5. Spriggsy's program runs the longest but also sorts the whole dump for files and folders. It uses a completely different method to allow us to independently test our lists and counts. Pipecom.bas is multi-purpose that Spriggsy set up for these tests with code to get folders and files. I embedded Pipecom.bas into Spriggsy Bas counter modified by me, bplus, to time, count and file Bas files like the other programs are setup to do. It was very helpful to have independent test of our counts and file lists, thanks Spriggsy.
30.0237, 29.0547

And thanks to SMcNeill for his help with all this.